The generative power of rule orderings in formal grammars*

نویسنده

  • FRANCIS JEFFRY PELLETIER
چکیده

One way of 'restricting linguistic theory' is the L-view: place sufficient restrictions on the allowable rules of grammars so as to reduce their generative power. Another way is the G-view: disallow certain grammars, regardless of whether this results in a reduction of generative capacity. The present paper adopts the L-view and, consequently, investigates the generative power of various theories. One area in linguistics where restrictions on linguistic theory have been advocated is in the ordering (within the cycle) of the application of the rules which generate the language. We consider eight proposals: Total Ordering; Partial Ordering (= Total Ordering plus iterative application); Semi Ordering ( = Anderson's 'local ordering' without iterative application); Semi Partial Ordering ( = Semi Ordering plus iterative application); Unorder ings ( = Ringen 'Condition VI, unmodified'); Quasi Orderings ( = Ringen 'Condition VI, modified'); Random Orderings; and Simultaneous Application. If, for any grammar obeying rule ordering conditions A there is a grammar obeying rule ordering conditions B which contains exactly the same class of derivations, then rule ordering theory B is at least as powerful in strong generative capacity as rule ordering theory A. Similar considerations are used to define the notions of equivalent, more powerful, and noncomparable in strong generative capacity. A series of theorems are proved showing the relative strength of the eight rule ordering theories. Some linguists who advocate 'random ordering' actually have in mind random ordering plus some 'universal principles'. We investigate the effect of four of these principles from the standpoint of the L-view, showing that two of them are strongly equivalent to total orderings and that two of them are intermediate between total and partial orderings. We close with an indication of what the role of mathematical linguistics should be for the ordinary working linguist. Linguistics 18 (1980), 017-072. 0024-3949/80/0018-0017 $2.00 © Mouton Publishers, The Hague Brought to you by | University of Alberta Library

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Formal Properties Of Rule Orderings In Linguistics

The discovery in the late 1960's that standard linguistic theory (of Chomsky's Aspects) was equivalent in generative power to unrestricted rewrite rules caused linguists to search for a "stronger linguistic metatheory". It seemed to some of these researchers that this meant describing linguistic theory by means of rules which were more restricted than type 0 languages. Such a view we call the L...

متن کامل

Alternating Regular Tree Grammars in the Framework of Lattice-Valued Logic

In this paper, two different ways of introducing alternation for lattice-valued (referred to as {L}valued)  regular tree grammars and {L}valued top-down tree automata are compared. One is the way which defines the alternating regular tree grammar, i.e., alternation is governed by the non-terminals of the grammar and the other is the way which combines state with alternation. The first way is ta...

متن کامل

On the Generative Power of ω-Grammars and ω-Automata

An ω-grammar is a formal grammar used to generateω-words (i.e. infinite length words), while an ω-automaton is an automaton used to recognize ω-words. This paper gives clean and uniform definitions for ω-grammars and ω-automata, provides a systematic study of the generative power of ω-grammars with respect to ω-automata, and presents a complete set of results for various types of ω-grammars and...

متن کامل

Synchronous Formal Systems Based on Grammars and Transducers

This paper is an extended abstract of a doctoral thesis which studies synchronous formal systems based on grammars and transducers, investigating both theoretical properties and practical application perspectives. It introduces new concepts and definitions building upon the well-known principles of regulated rewriting and synchronization. An alternate approach to synchronization of context-free...

متن کامل

On the Generative Power of CD Grammar Systems With Scattered Context Components

There is a long time open problem regarding the generative power of scattered context grammars without erasing rules. This problem tries to compare their generative power with context-sensitive grammars. In this paper, modified version of this problem will be presented. This modified version combines scattered context grammars with another model — grammar systems. It will be shown that when con...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2009